منابع مشابه
Ensemble inequivalence in random graphs
We present a complete analytical solution of a system of Potts spins on a random k-regular graph in both the canonical and microcanonical ensembles, using the Large Deviation Cavity Method (LDCM). The solution is shown to be composed of three different branches, resulting in an non-concave entropy function.The analytical solution is confirmed with numerical Metropolis and Creutz simulations and...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملStatistical ensemble of scale-free random graphs.
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is characterized by two global parameters, the fractal and the spectral dimensions, which are explicitly calculated. It is discussed in detail how the geometry of the g...
متن کاملPreemptive Ensemble Motion Planning on a Tree
Consider the problem of finding a minimum cost tour to transport a set of objects uetween the vertices of a tree by a vehicle that travels along the edges of the tree. The vehicle can carry only one object at a time, and it starts and finishes at the same vertex of the tree. It is shown that if objects can ue dropped at intermediate vertices along its route and picked up later, then the prol>le...
متن کاملNonpreemptive Ensemble Motion Planning on a Tree
Consider the problem of transporting a set of objects between the vertices of a tree by a vehicle that travels along the edges of the tree. The vehicle can carry only one object at a time, and it starts and finishes at the same vertex of the tree. It is shown that if each object must be carried directly from its initial vertex to its destina.tion then finding a minimum cost transportation is NP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2007
ISSN: 0730-0301,1557-7368
DOI: 10.1145/1289603.1289608